منابع مشابه
Normal Natural Deduction Proofs (in classical logic)
Natural deduction (for short: nd-) calculi have not been used systematically as a basis for automated theorem proving in classical logic. To remove objective obstacles to their use we describe (1) a method that allows to give semantic proofs of normal form theorems for nd-calculi and (2) a framework that allows to search directly for normal nd-proofs. Thus, one can try to answer the question: H...
متن کاملNatural Deduction for Modal Logic with a Backtracking Operator
Harold Hodes in [1] introduces an extension of rst-order modal logic featuring a backtracking operator, and provides a possible worlds semantics, according to which the operator is a kind of device for ‘world travel’; he does not provide a proof theory. In this paper, I provide a natural deduction system for modal logic featuring this operator, and argue that the system can be motivated in ter...
متن کاملNatural Deduction for Full S5 Modal Logic with Weak Normalization
Natural deduction systems for classical, intuitionistic and modal logics were deeply investigated by Prawitz [10] from a proof-theoretical perspective. Prawitz proved weak normalization for classical logic just for a language without ∨, ∃ and with a restricted application of reduction ad absurdum. Reduction steps related to ∨, ∃ and classical negation brings about a lot of problems solved only ...
متن کاملPresentation of proofs in modal natural deduction
We introduce a calculus for transforming first-order proofs of theorems originally formulated in modal logic, into modal natural deduction proofs. With a transformation procedure based on this calculus, we are able to present a proof in the language in which the problem was originally formulated, and in a formalism giving better insight into the contents of the proof. As a target language of th...
متن کاملNatural Deduction for Hybrid Logic
In this paper we give a natural deduction formulation of hybrid logic. Our natural deduction system can be extended with additional inference rules corresponding to conditions on the accessibility relations expressed by so-called geometric theories. Thus, we give natural deduction systems in a uniform way for a wide class of hybrid logics which appears to be impossible in the context of ordinar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1990
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093635420